Federal Employees Health Benefits (FEHB) Program: An Overview

[Excerpt] The Federal Employees Health Benefits (FEHB) Program provides health insurance to federal employees, retirees, and their dependents. This report provides a general overview of FEHB. It describes the structure of FEHB, including eligibility for the program and coverage options available to enrollees, as well as premiums, benefits and cost sharing, and general financing of FEHB. The report also describes the role of the Office of Personnel Management (OPM) in administering the program

Parallel Recursive State Compression for Free

This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a tree-based multi-core compression method, which works by leveraging sharing among sub-vectors of state vectors. An algorithmic analysis of both worst-case and optimal compression ratios shows the potential to compress even large states to a small constant on average (8 bytes). Our experiments demonstrate that this holds up in practice: the median compression ratio of 279 measured experiments is within 17% of the optimum for tree compression, and five times better than the median compression ratio of SPIN's COLLAPSE compression. Our algorithms are implemented in the LTSmin tool, and our experiments show that for model checking, multi-core tree compression pays its own way: it comes virtually without overhead compared to the fastest hash table-based methods.Comment: 19 page

Resonating silicon beam force sensor

A resonating silicon-beam force sensor is being deveoped using micro-machining of silicon and IC-compatible processes. Results are reported here of measurements on the force-to-frequency transfer of bare silicon prototypes. The measurements with forces on the sensor beam up to 0.4 N shows a frequency shift of 3.1 to 5.2 times the unloaded resonance frequency f0(f0 congruent with 3 to 5 kHz), depending on the exact dimensions. Considering these figures, we can predict a frequency shift of 18.3 to 27.6 kHz at the maximum load of 1.0 N for the measured samples. Due to the sample lay-out, a force transfer is present from the externally applied force to the actual pulling force on the sensor beam. Using a simple model to calculate this reduction, we obtain good agreement between the measurements and predictions

An ellipsometric study of protein adsorption at the saliva-air interface

At the liquid-air interface of human saliva a protein layer is adsorbed. From ellipsometric measurements it was found that the thickness of the surface layer ranged from 400 to 3600 Å and the amount of protein material adsorbed was 9–340 mg/m2. Based on the concentration of protein in the layer the samples could be classified into two groups: a low concentration (ca. 0.15 g/ml) and a high concentration (0.7–1.1 g/ml). In the low concentration group the surface layers appeared to be thin (500–600 Å) while those in the high concentration group appeared to be much thicker (1000–3500 Å). A correlation between the bulk pH and the thickness of the surface layer could be established

Magnetoresistance and negative differential resistance in Ni/Graphene/Ni vertical heterostructures driven by finite bias voltage: A first-principles study

Using the nonequilibrium Green function formalism combined with density functional theory, we study finite-bias quantum transport in Ni/Gr_n/Ni vertical heterostructures where $n$ graphene layers are sandwiched between two semi-infinite Ni(111) electrodes. We find that recently predicted "pessimistic" magnetoresistance of 100% for $n \ge 5$ junctions at zero bias voltage $V_b \rightarrow 0$, persists up to $V_b \simeq 0.4$ V, which makes such devices promising for spin-torque-based device applications. In addition, for parallel orientations of the Ni magnetizations, the $n=5$ junction exhibits a pronounced negative differential resistance as the bias voltage is increased from $V_b=0$ V to $V_b \simeq 0.5$ V. We confirm that both of these nonequilibrium effects hold for different types of bonding of Gr on the Ni(111) surface while maintaining Bernal stacking between individual Gr layers.Comment: 6 pages, 5 figures, PDFLaTeX; Figure labels correcte

Rheological properties of human saliva

From measurements with a Couette-type viscometer provided with a guard ring it was shown that at the saliva-air interface a protein layer is adsorbed. Measurements of the surface shear modulus of this layer on saliva of 7 healthy subjects were performed at a frequency of about 70 Hz and a temperature of 25 °C. For a surface age of about 1.5 h the surface shear modulus and the surface viscosity were in the order of 1 Nm−1 and 10−3 Nm−1 s, respectively. From ellipsometric measurements it was found that the thickness of the protein layer was approx. 100nm and, using this value, it could be concluded that the shear modulus and the dynamic viscosity were in the order of 107 Pa and 104 Pa s, respectively. The layer appeared to be fragile. Even shear deformation amplitudes of 4 × 10−5 are too high to assure linearity. The complex viscosity (η = η′ − iη′′) of the bulk liquid of human submandibular saliva below the absorbed layer was measured in the frequency range 70 Hz–200 kHz with 3 torsional resonators, each for a different frequency, and a Ni-tube resonator. It was concluded, that the real part of the complex viscosity (η′) decreases from 1.1 mPa s at 70 Hz to a value of 0.95 mPa s at high frequencies. Except at the lowest frequency (70 Hz), the value of η′′ was too small to be detected

Distributed Branching Bisimulation Minimization by Inductive Signatures

We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement process and the signatures have been optimized to exploit the fact that the input graph contains no tau-loops. The optimization in the refinement process is meant to reduce both the number of iterations needed and the memory requirements. In the former case we cannot prove that there is an improvement, but our experiments show that in many cases the number of iterations is smaller. In the latter case, we can prove that the worst case memory use of the new algorithm is linear in the size of the state space, whereas the old algorithm has a quadratic upper bound. The paper includes a proof of correctness of the new algorithm and the results of a number of experiments that compare the performance of the old and the new algorithms